Scheduling Parallel Applications in Networks of Mixed Uniprocessor/Multiprocessor Workstations

Partitioned Fixed-Priority Multiprocessor Scheduling for Mixed-Criticality Real-Time Systems Master of Science Thesis in Programme Computer Systems and Networks

The scheduling of real-time systems has been the subject of research for many years since it has many implications for safety-critical embedded real-time systems. Within that field, there have been two recent developments which are the subject of this thesis. The first is the development of new scheduling theory for mixedcriticality systems, i.e. systems in which functions of differing importan...

Scalable Inter-Cluster Communication Systems for Clustered Multiprocessors

As workstation clusters move away from uniprocessors in favor of multiprocessors to support the increasing computational needs of distributed applications, greater demands are placed on the communication interfaces that couple individual workstations. This paper investigates scalable, e cient, and reliable communication systems for multiprocessor clusters that use commodity local area networks ...

Processor Design Issues for Parallel Machines

This paper addresses processor design issues for multiprocessor architectures. We assert that some architectural features desirable for a uniprocessor are not as eeective in a multiprocessor. Issues aaecting processor design include granularity, degree of parallelism, cache and network eeects, and dynamic load balancing. We show that using single-instruction-issue processor with dynamic instruc...

Depth Report Multiprogrammed Multiprocessor Scheduling Contents 1 Introduction 2 2 Performance Measures 2 3 Review of Uniprocessor Scheduling Results 3 4 Multiprocessor Scheduling 4

An Efficient RMS Admission Control and its Application to Multiprocessor Scheduling - Parallel Processing Symposium, 1998, and Symposium on Parallel and Distributed Processing 1998. 19

A real-time system must execute functionally correct computations in a timely mannel: In order to guarantee that all tasks accepted in the system will meet their timing requirements, an admission control algorithm must be used to only accept tasks whose requirements can be satisfied. Rate-monotonic scheduling (RMS) is arguably the best known scheduling policy for periodic real-time tasks on uni...